new dungeon keeper game

define dp[][] to represent the minimum health required from (I,J) to the end point (m-1,n-1), then the recursive equation is dp[i][j] = max (min (dp[i][j+1], dp[i+1][j])-dungeon[i ][J], 0), if dungeon[i][j] is positive, subtract a positive number, and the initial required health is reduced. The same can be understood dungeon[i][j] is a negative case. and 0 Maxim

classSolution { Public intCALCULATEMINIMUMHP (int[] Dungeon) { intm =dungeon.length; intn = dungeon[0].length; int[] DP =New int[M][n]; Dp[m-1][n-1] = Math.max (0, 0-dungeon[m-1][n-1]); for(inti=m-2;i>=0;i--) {Dp[i][n-1] = Math.max (0,dp[i+1][n-1]-dungeon[i][n-1]);

/** 174. Dungeon Game * 12.30 by Mingyang * Dp[i][j] means the minimum HP required to ensure Knight does not die after entering this lattice. * Dp[i][j] is the minimum health value before he enters (I,J). * If the value of a lattice is negative, then the minimum HP required before entering this lattice is-dungeon[i][j] + 1. If the value of the lattice

Leetcode: Dungeon Game, leetcodedungeon The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially positioned in the top-left room and must fight his way through the

, such as test instructions to the 3x3 table, first observe the following several numbers -10 1 30 -5 At 5 at the beginning of at least 5, to arrive from 1 to need 5-1=4, from 30 to reach the need to 5-30=-25, that you do not need to carry anything to reach the end, that is 0, in turn, in 10 except, 10 right is 4, the bottom is 0,(-10) = 14, which means you need to take 14 to the right, while the downward need 0-(-10) = 10, obvious

) Notes: The Knight ' s Health has no upper bound. Any hostel can contain threats or power-ups, even the first, the knight enters and the Bottom-right, where the Princ ESS is imprisoned. Classic DP problem, take the map, ensure that each school is greater than or equal to 1DP[I][J] = max (1, Min (dp[i][j+1], dp[i+1][j]) + dungeon[i][j])public class Solution {public int calculateminimumhp (int[][]

) Notes: The Knight ' s Health has no upper bound. Any hostel can contain threats or power-ups, even the first, the knight enters and the Bottom-right, where the Princ ESS is imprisoned. Public classSolution { Public intCALCULATEMINIMUMHP (int[] Dungeon) { /*DP thought, and it was from the right down to the top left, and walked backwards. The meaning of dp[i][j] is the minimum health required to i,j points, note that t

Leetcode 174: Dungeon Game, leetcodedungeon.Dungeon GameTotal Accepted:332Total Submissions:2130 The demons had captured the princess (P) And imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) Was initially positioned in the top-lef